A counting formula about the symplectic similitude group

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

a note on the affine subgroup of the symplectic group

we examine the symplectic group $sp_{2m}(q)$ and its correspondingaffine subgroup. we construct the affine subgroup and show that itis a split extension. as an illustration of the above we study theaffine subgroup $2^5{:}sp_4(2)$ of the group $sp_6(2)$.

متن کامل

The Gopakumar-vafa Formula for Symplectic Manifolds

The Gopakumar-Vafa conjecture predicts that the Gromov-Witten invariants of a CalabiYau 3-fold can be canonically expressed in terms of integer invariants called BPS numbers. Using the methods of symplectic Gromov-Witten theory, we prove that the Gopakumar-Vafa conjecture holds for any symplectic Calabi-Yau 6-manifold, and hence for Calabi-Yau 3-folds. The results extend to all symplectic 6-man...

متن کامل

A Formula for the Chern Classes of Symplectic Blow-ups

It is shown that the formula for the Chern classes (in the Chow ring) of blow-ups of algebraic varieties, due to Porteous and Lascu-Scott, also holds (in the cohomology ring) for blow-ups of symplectic and complex manifolds. This was used by the second-named author in her solution of the geography problem for 8-dimensional symplectic manifolds. The proof equally applies to real blow-ups of arbi...

متن کامل

A Simple Counting Formula for Lattice Paths

Let α,β ,x,y be positive integers. Fix a line L : Y = αX + β , and a lattice point Q(x,y) on L. It is well known that the number of lattice paths from the origin to Q which touches L only at Q is given by β x + y ( x + y x )

متن کامل

A counting formula for certain hierarchical orderings

A hierarchy is a distribution of elements on levels. For a given number of elements a certain hierarchy can be arrangend in a finite number of ways. We provide a counting formula for certain types of hierarchies. Mainly, this formula is a sum over the integer partitions of the number of elements. Furthermore, several basic combinatorical numbers like the Stirling numbers of the second kind, the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Australian Mathematical Society

سال: 2001

ISSN: 0004-9727,1755-1633

DOI: 10.1017/s0004972700019079